Unicyclic and bicyclic graphs having minimum degree distance

نویسنده

Alexandru I. Tomescu

چکیده

In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degree distance are given. © 2007 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On reverse degree distance of unicyclic graphs

The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...

متن کامل

On the harmonic index of the unicyclic and bicyclic graphs

The harmonic index is one of the most important indices in chemical and mathematical fields. It’s a variant of the Randić index which is the most successful molecular descriptor in structure-property and structureactivity relationships studies. The harmonic index gives somewhat better correlations with physical and chemical properties comparing with the well known Randić index. The harmonic ind...

متن کامل

Degree Resistance Distance of Unicyclic Graphs

Let G be a connected graph with vertex set V (G). The degree resistance distance of G is defined as DR(G) = ∑ fu,vg V (G)[d(u) +d(v)]R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between u and v. In this paper, we characterize n-vertex unicyclic graphs having minimum and second minimum degree resistance distance.

متن کامل

Ela Some Results on the Spectral Radii of Trees, Unicyclic, and Bicyclic Graphs

Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...

متن کامل